Cumulative Message Authentication Codes for Resource-Constrained IoT Networks

نویسندگان

چکیده

In resource-constrained Internet-of-Things networks, the use of conventional message authentication codes (MACs) to provide and integrity is not possible due large size MAC output. A straightforward yet naive solution this problem employ a truncated which undesirably sacrifices cryptographic strength in exchange for reduced communication overhead. article, we address by proposing novel approach called cumulative (CuMAC), consists two distinctive procedures: 1) aggregation 2) accumulation. aggregation, sender generates compact tags from segments multiple MACs using systematic encoding procedure. accumulation, receiver accumulates underlying collecting verifying tags. Embodied with these procedures, CuMAC enables achieve an advantageous tradeoff between latency processing Furthermore, some latency-sensitive messages where may be unacceptable, propose variant that refer as speculation (CuMAC/S). addition accumulation CuMAC/S procedure predicting future values precomputing corresponding segments. For can reliably speculated, significantly reduces verification without compromising strength. We have carried out comprehensive evaluation through simulation prototype implementation on real car.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aggregate Message Authentication Codes

We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender. We suggest aggregate MACs as an appropriate tool for au...

متن کامل

Quantum message authentication codes

I describe protocols which assure the recipient of a quantum state that it has come from a sender with whom he has previously shared secret key. Their security is information-theoretic (“unconditional”) rather than based on computational assumptions. A particular class of such protocols is constructed, for which the different keys correspond to different, secret, quantum error detecting codes. ...

متن کامل

Algebraic Message Authentication Codes

This paper suggests a message authentication scheme, which can be efficiently used for secure digital signature creation. The algorithm used here is an adjusted union of the concepts which underlie projective geometry and group structure on circles. The authentication is done through a key, which iterates over the complete message string to produce the signature. The iteration is not only based...

متن کامل

Cryptanalysis of Message Authentication Codes

This paper gives a survey of attacks on Message Authentication Codes (MACs). First it defines the required security properties. Next it describes generic forgery and key recovery attacks on MACs. Subsequently an overview is presented of most MAC constructions and on attacks on these algorithms. The MACs described include CBC-MAC and its variants, the MAC algorithms derived from cryptographic ha...

متن کامل

Quantum-Secure Message Authentication Codes

We construct the first Message Authentication Codes (MACs) that are existentially unforgeable against a quantum chosen message attack. These chosen message attacks model a quantum adversary’s ability to obtain the MAC on a superposition of messages of its choice. We begin by showing that a quantum secure PRF is sufficient for constructing a quantum secure MAC, a fact that is considerably harder...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Internet of Things Journal

سال: 2021

ISSN: ['2372-2541', '2327-4662']

DOI: https://doi.org/10.1109/jiot.2021.3074054